The New Method of Adaptive Cpu Scheduling Using Fonseca and Fleming’s Genetic Algorithm

The CPU scheduling is one of the most important tasks of the operating system. Many algorithms are designed and used in this regard each having advantages and disadvantages. In this paper a new algorithm for the CPU scheduling is presented using FFGA (Fonseca and Fleming’s Genetic Algorithm) multiobjective optimization. Contrary to the classical algorithms in use, it uses the three parameters of CPU burst time; I/O devices service time, and priority of process instead of using one parameter of CPU burst time. The important point is the adaptation of the algorithm which selects a special process depending on the system situation. The performance of this algorithm was compared with seven classical scheduling algorithms (FCFS, RR (equal, prioritized), SJF (preemptive, non-preemptive, Priority (preemptive, nonpreemptive)), and the results showed that the performance of the proposed method is more optimized than other methods. The proposed algorithm optimizes the average waiting time and response time for the processes.